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 29, 2026 09:36wnwnScore: 3,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 09:363,30436,312,43626,391,0001,038,0002,113,536
2Sep 29, 2026 09:363,30936,312,27426,468,0001,002,0002,113,536
3Sep 29, 2026 09:363,31236,289,38026,479,0001,012,0002,113,536
4Sep 29, 2026 09:363,31336,377,84826,466,0001,034,0002,113,536
5Sep 29, 2026 09:363,32036,446,50526,556,0001,007,0002,113,536
6Sep 29, 2026 09:363,33436,391,32526,663,0001,011,0002,113,536
7Sep 29, 2026 09:363,37636,885,75826,993,0001,034,0002,113,536
8Sep 29, 2026 09:363,44337,386,38127,544,0001,041,0002,113,536
9Sep 29, 2026 09:363,47538,379,16927,840,0001,009,0002,113,536