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 listAug 15, 2026 12:53Tomislav TunkovicTomislav TunkovicScore: 4,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:534,62246,789,10538,368,000020,480
2Aug 15, 2026 12:534,62546,822,96838,395,000020,480
3Aug 15, 2026 12:534,62946,876,61438,424,000020,480
4Aug 15, 2026 12:534,63246,911,12138,452,000020,480
5Aug 15, 2026 12:534,63446,953,87038,465,000020,480
6Aug 15, 2026 12:534,63746,965,33938,492,000020,480
7Aug 15, 2026 12:534,63746,972,17438,493,000020,480
8Aug 15, 2026 12:534,64046,903,89638,517,000020,480
9Aug 15, 2026 12:534,66247,147,62938,696,000020,480