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 listApr 19, 2026 04:14wnwnScore: 4,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 04:144,01257,709,68032,291,0001,009,0002,498,560
2Apr 19, 2026 04:144,02854,940,43732,422,0001,013,0002,494,464
3Apr 19, 2026 04:144,03153,651,72832,447,0001,013,0002,269,184
4Apr 19, 2026 04:144,03459,813,05132,465,0001,014,0002,269,184
5Apr 19, 2026 04:144,03656,662,33632,482,0001,015,0002,269,184
6Apr 19, 2026 04:144,04960,778,80732,587,0001,018,0002,490,368