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 11, 2026 01:54Josu San MartinJosu San MartinScore: 3,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:543,85439,720,56530,927,0001,063,0002,113,536
2May 11, 2026 01:543,86939,848,31831,050,0001,070,0002,113,536
3May 11, 2026 01:543,89940,811,19431,271,0001,093,0002,113,536
4May 11, 2026 01:543,90140,057,48831,321,0001,062,0002,113,536
5May 11, 2026 01:543,90640,411,53831,336,0001,090,0002,113,536
6May 11, 2026 01:543,90742,125,80231,333,0001,098,0002,113,536
7May 11, 2026 01:543,91842,329,90131,436,0001,085,0002,113,536
8May 11, 2026 01:543,94841,781,03531,696,0001,077,0002,113,536
9May 11, 2026 01:543,99041,429,52932,009,0001,112,0002,113,536