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 27, 2026 16:58Victor MerckléVictor MerckléScore: 3,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:593,76839,503,21930,153,0001,129,0002,113,536
2Aug 27, 2026 16:593,77539,625,41230,268,0001,072,0002,113,536
3Aug 27, 2026 16:593,77939,596,46330,253,0001,113,0002,113,536
4Aug 27, 2026 16:593,78940,603,71530,320,0001,133,0002,113,536
5Aug 27, 2026 16:593,79239,722,49630,343,0001,132,0002,113,536
6Aug 27, 2026 16:593,80139,851,48930,500,0001,052,0002,113,536
7Aug 27, 2026 16:593,80139,813,15830,473,0001,079,0002,113,536
8Aug 27, 2026 16:593,81640,651,52430,560,0001,113,0002,113,536
9Aug 27, 2026 16:593,89241,437,77431,294,0001,017,0002,113,536