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 17, 2026 08:08Charles CabergsCharles CabergsScore: 64,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 08:0864,186554,419,249530,746,0001,999,0002,281,472
2Apr 17, 2026 08:0864,190557,518,878530,775,0001,999,0002,281,472
3Apr 17, 2026 08:0864,207558,376,365530,918,0001,999,0002,281,472