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 17, 2026 21:01zielajzielajScore: 3,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:013,29737,065,46926,347,0001,021,0002,113,536
2May 17, 2026 21:013,29938,125,09326,337,0001,048,0002,113,536
3May 17, 2026 21:013,30336,907,74526,395,0001,028,0002,113,536
4May 17, 2026 21:013,30835,420,55326,426,0001,035,0002,113,536
5May 17, 2026 21:013,31437,148,54126,492,0001,018,0002,113,536
6May 17, 2026 21:013,34236,595,04226,718,0001,024,0002,113,536
7May 17, 2026 21:013,36638,650,25126,914,0001,027,0002,113,536
8May 17, 2026 21:013,42437,386,11327,388,0001,037,0002,113,536
9May 17, 2026 21:013,49640,455,69728,004,0001,020,0002,113,536