Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 15, 2026 01:04Ondřej PolaneckýOndřej PolaneckýScore: 20,296Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 01:0420,279193,095,821168,316,00002,289,664
2Mar 15, 2026 01:0420,279195,341,551167,317,0001,001,0002,392,064
3Mar 15, 2026 01:0420,283189,819,228167,349,0001,002,0002,273,280
4Mar 15, 2026 01:0420,287196,060,203168,382,00002,273,280
5Mar 15, 2026 01:0420,296201,542,778167,451,0001,002,0002,289,664
6Mar 15, 2026 01:0420,299194,372,724167,481,0001,002,0002,277,376
7Mar 15, 2026 01:0420,306199,664,978167,534,0001,003,0002,281,472
8Mar 15, 2026 01:0420,309195,843,541167,563,0001,003,0002,289,664
9Mar 15, 2026 01:0420,327195,958,041167,718,000998,0002,387,968