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 listJan 9, 2026 07:56Anurag HoodaAnurag HoodaScore: 2,067,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 07:562,058,38817,119,245,69817,016,653,00067,970,0002,289,664
2Jan 9, 2026 07:562,063,48517,165,114,40717,060,954,00065,968,0002,293,760
3Jan 9, 2026 07:562,064,19717,168,488,35317,070,869,00061,963,0002,281,472
4Jan 9, 2026 07:562,065,76717,175,179,90917,073,900,00071,970,0002,281,472
5Jan 9, 2026 07:562,067,40217,188,175,36417,068,478,00090,959,0002,293,760
6Jan 9, 2026 07:562,069,70917,209,880,68917,125,607,00052,977,0002,265,088
7Jan 9, 2026 07:562,071,74417,229,177,22417,117,516,00077,956,0002,281,472
8Jan 9, 2026 07:562,072,38717,234,380,91617,143,832,00056,976,0002,289,664
9Jan 9, 2026 07:562,243,34718,657,951,50218,542,813,00076,966,0002,281,472