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 7, 2026 04:25wnwnScore: 3,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:323,29035,320,13326,282,0001,030,0002,113,536
2Jul 7, 2026 04:323,29835,415,15326,364,0001,014,0002,113,536
3Jul 7, 2026 04:323,30535,201,25626,413,0001,021,0002,113,536
4Jul 7, 2026 04:323,31035,280,50926,448,0001,025,0002,113,536
5Jul 7, 2026 04:323,31935,390,57526,518,0001,030,0002,113,536
6Jul 7, 2026 04:323,33639,873,84226,657,0001,034,0002,113,536
7Jul 7, 2026 04:323,36835,971,03926,937,0001,024,0002,113,536
8Jul 7, 2026 04:323,44336,498,89527,520,0001,057,0002,113,536
9Jul 7, 2026 04:323,45336,629,41427,636,0001,024,0002,113,536