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 listAug 31, 2026 00:30Josu San MartinJosu San MartinScore: 4,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 00:354,58046,408,09236,977,0001,039,0002,113,536
2Aug 31, 2026 00:354,58246,444,37436,990,0001,041,0002,113,536
3Aug 31, 2026 00:354,58446,478,92637,038,0001,012,0002,113,536
4Aug 31, 2026 00:354,58546,569,51737,016,0001,041,0002,113,536
5Aug 31, 2026 00:354,58946,562,83637,026,0001,068,0002,113,536
6Aug 31, 2026 00:354,64946,990,28837,553,0001,035,0002,113,536
7Aug 31, 2026 00:354,66056,564,50537,524,0001,158,0002,113,536
8Aug 31, 2026 00:354,66754,606,11737,718,0001,026,0002,113,536
9Aug 31, 2026 00:354,68562,348,65337,807,0001,081,0002,113,536