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 22, 2026 23:55M-RochatM-RochatScore: 6,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:556,60564,499,10853,812,0001,014,0002,113,536
2May 22, 2026 23:556,60566,751,28253,795,0001,034,0002,113,536
3May 22, 2026 23:556,61564,550,52253,894,0001,015,0002,113,536
4May 22, 2026 23:556,63269,140,62854,038,0001,015,0002,113,536
5May 22, 2026 23:556,65166,295,87854,188,0001,017,0002,113,536
6May 22, 2026 23:556,65166,223,34554,190,0001,015,0002,113,536
7May 22, 2026 23:556,69367,128,30154,538,0001,016,0002,113,536
8May 22, 2026 23:556,69568,025,51154,554,0001,015,0002,113,536
9May 22, 2026 23:556,74166,207,27554,942,0001,015,0002,113,536