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 14, 2026 20:46Ondřej PolaneckýOndřej PolaneckýScore: 2,068,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 20:462,063,94817,163,148,64517,064,802,00065,968,0002,289,664
2Mar 14, 2026 20:462,065,37717,174,998,37817,076,655,00065,975,0002,289,664
3Mar 14, 2026 20:462,067,92617,200,081,50817,093,823,00069,962,0002,277,376
4Mar 14, 2026 20:462,067,95417,201,956,27217,103,051,00060,971,0002,277,376
5Mar 14, 2026 20:462,068,53917,199,399,88117,105,907,00062,970,0002,285,568
6Mar 14, 2026 20:462,068,68517,199,844,00417,104,116,00065,973,0002,285,568
7Mar 14, 2026 20:462,069,61017,213,451,93217,119,785,00057,975,0002,277,376
8Mar 14, 2026 20:462,070,28217,214,410,32817,124,373,00058,970,0002,277,376
9Mar 14, 2026 20:462,070,81117,220,646,42117,118,760,00068,974,0002,277,376