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 10, 2026 08:56wnwnScore: 3,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 08:573,30035,255,64226,366,0001,029,0002,113,536
2Jul 10, 2026 08:573,30035,216,34626,373,0001,022,0002,113,536
3Jul 10, 2026 08:573,30235,426,01926,380,0001,033,0002,113,536
4Jul 10, 2026 08:573,32135,721,24026,509,0001,057,0002,113,536
5Jul 10, 2026 08:573,32235,686,34926,567,0001,011,0002,113,536
6Jul 10, 2026 08:573,41636,832,97227,327,0001,031,0002,113,536
7Jul 10, 2026 08:573,44936,489,48727,627,0001,004,0002,113,536
8Jul 10, 2026 08:573,45637,285,15327,665,0001,028,0002,113,536
9Jul 10, 2026 08:573,47337,308,81227,782,0001,049,0002,113,536