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 04:56Josu San MartinJosu San MartinScore: 4,296Success
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 04:564,28253,985,74934,500,0001,043,0002,543,616
2May 10, 2026 04:564,28951,980,03134,533,0001,066,0002,551,808
3May 10, 2026 04:564,29252,737,25334,573,0001,055,0002,551,808
4May 10, 2026 04:564,29550,858,89834,599,0001,055,0002,555,904
5May 10, 2026 04:564,29652,960,30234,601,0001,060,0002,543,616
6May 10, 2026 04:564,29950,778,57234,642,0001,047,0002,543,616
7May 10, 2026 04:564,30352,648,34534,679,0001,038,0002,547,712
8May 10, 2026 04:564,30353,399,17234,684,0001,032,0002,551,808
9May 10, 2026 04:564,31450,951,65034,633,0001,179,0002,297,856