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 listMay 10, 2026 19:01Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:02040,041,94331,023,0001,068,0002,113,536expected "53681116822380115 ", got "53681116566380115 "
2May 10, 2026 19:023,85640,224,35030,952,0001,061,0002,113,536
3May 10, 2026 19:023,86339,818,93530,953,0001,112,0002,113,536
4May 10, 2026 19:023,86741,699,69931,025,0001,074,0002,113,536
5May 10, 2026 19:023,86941,798,55931,026,0001,087,0002,113,536
6May 10, 2026 19:023,88439,572,56231,168,0001,075,0002,113,536
7May 10, 2026 19:023,90542,711,24931,350,0001,062,0002,113,536
8May 10, 2026 19:023,90540,884,51231,340,0001,077,0002,113,536
9May 10, 2026 19:023,94043,105,85031,628,0001,076,0002,113,536