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 listSep 24, 2026 03:59wnwnScore: 3,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:013,45737,212,49527,609,0001,087,00020,480
2Sep 24, 2026 04:013,46037,556,58627,374,0001,349,00020,480
3Sep 24, 2026 04:013,50537,873,58627,601,0001,496,00020,480
4Sep 24, 2026 04:013,51437,942,40227,757,0001,413,00020,480
5Sep 24, 2026 04:013,51937,973,91227,777,0001,436,0002,113,536
6Sep 24, 2026 04:013,57238,401,84628,413,0001,237,0002,113,536
7Sep 24, 2026 04:013,65839,135,97329,223,0001,146,00020,480
8Sep 24, 2026 04:013,66939,787,50329,216,0001,238,0002,113,536
9Sep 24, 2026 04:013,74539,838,61528,419,0002,669,0002,113,536