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 16, 2026 07:46wnwnScore: 3,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 07:463,51737,335,75128,191,0001,002,0002,113,536
2Jul 16, 2026 07:463,51837,355,47028,192,0001,008,0002,113,536
3Jul 16, 2026 07:463,52137,163,75028,179,0001,050,0002,113,536
4Jul 16, 2026 07:463,52237,346,29528,200,0001,036,0002,113,536
5Jul 16, 2026 07:463,52437,380,41028,175,0001,075,0002,113,536
6Jul 16, 2026 07:463,55137,641,31928,464,0001,010,0002,113,536
7Jul 16, 2026 07:463,55637,427,83428,512,0001,007,0002,113,536
8Jul 16, 2026 07:463,56640,613,60028,584,0001,017,0002,113,536
9Jul 16, 2026 07:463,68638,809,73929,557,0001,040,0002,113,536