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 listMay 12, 2026 03:17cashkarucashkaruScore: 32,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 03:1732,610280,395,915269,664,0001,002,0002,113,536
2May 12, 2026 03:1732,615280,468,126269,710,0001,002,0002,113,536
3May 12, 2026 03:1732,616281,671,232269,715,0001,002,0002,113,536
4May 12, 2026 03:1732,620280,791,967269,746,0001,002,0002,113,536
5May 12, 2026 03:1732,622279,859,010269,762,0001,004,0002,113,536
6May 12, 2026 03:1732,644279,899,126269,946,0001,003,0002,113,536
7May 12, 2026 03:1732,654281,713,819270,033,0001,003,0002,113,536
8May 12, 2026 03:1732,690280,218,866270,331,0001,003,0002,113,536
9May 12, 2026 03:1732,713281,025,727270,520,0001,004,0002,113,536