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 listSep 25, 2026 05:26flavio87flavio87Score: 3,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 05:273,59839,317,37828,775,0001,096,0002,113,536
2Sep 25, 2026 05:273,59839,113,30628,799,0001,072,0002,113,536
3Sep 25, 2026 05:273,59938,685,68428,791,0001,081,0002,113,536
4Sep 25, 2026 05:273,59940,601,24728,791,0001,086,0002,113,536
5Sep 25, 2026 05:273,59938,744,54428,794,0001,078,0002,113,536
6Sep 25, 2026 05:273,60038,705,61028,815,0001,073,0002,113,536
7Sep 25, 2026 05:273,60039,392,01328,781,0001,101,0002,113,536
8Sep 25, 2026 05:273,60339,431,08928,840,0001,070,0002,113,536
9Sep 25, 2026 05:273,71640,682,42729,777,0001,068,0002,113,536