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 12, 2026 23:38Victor MerckléVictor MerckléScore: 4,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 23:394,61546,486,22337,200,0001,112,0002,117,632stderr
2Aug 12, 2026 23:394,64846,970,47737,489,0001,095,0002,117,632stderr
3Aug 12, 2026 23:394,65947,143,95737,568,0001,107,0002,117,632stderr
4Aug 12, 2026 23:394,66647,223,16637,675,0001,055,0002,117,632stderr
5Aug 12, 2026 23:394,67947,030,76137,696,0001,141,0002,117,632stderr
6Aug 12, 2026 23:394,68147,373,24137,691,0001,166,0002,117,632stderr
7Aug 12, 2026 23:394,68447,305,32737,841,0001,038,0002,117,632stderr
8Aug 12, 2026 23:394,68947,484,99037,831,0001,091,0002,117,632stderr
9Aug 12, 2026 23:394,72347,450,35738,154,0001,052,0002,117,632stderr