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 listJul 3, 2026 16:58Josu San MartinJosu San MartinScore: 51,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:0551,510436,913,847426,525,0001,010,0002,113,536
2Jul 3, 2026 17:0551,511437,071,045426,543,0001,002,0002,113,536
3Jul 3, 2026 17:0551,512437,026,948426,552,0001,003,0002,113,536
4Jul 3, 2026 17:0551,516436,983,314426,580,0001,003,0002,113,536
5Jul 3, 2026 17:0551,516436,915,959426,583,0001,003,0002,113,536
6Jul 3, 2026 17:0551,529437,084,085426,695,0001,003,0002,113,536
7Jul 3, 2026 17:0551,533437,651,269426,721,0001,003,0002,113,536
8Jul 3, 2026 17:0551,535437,137,312426,742,0001,003,0002,113,536
9Jul 3, 2026 17:0551,549437,381,702426,858,0001,003,0002,113,536