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 29, 2026 10:57Victor MerckléVictor MerckléScore: 4,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 10:584,78948,142,64838,744,0001,009,0002,117,632stderr
2Aug 29, 2026 10:584,79048,143,94038,739,0001,019,0002,117,632stderr
3Aug 29, 2026 10:584,79348,138,27738,780,0001,005,0002,117,632stderr
4Aug 29, 2026 10:584,79548,175,72338,778,0001,022,0002,117,632stderr
5Aug 29, 2026 10:584,79648,224,44038,771,0001,039,0002,117,632stderr
6Aug 29, 2026 10:584,80348,253,36638,862,0001,004,0002,117,632stderr
7Aug 29, 2026 10:584,80448,231,71138,863,0001,012,0002,117,632stderr
8Aug 29, 2026 10:584,94949,420,58940,073,0001,007,0002,117,632stderr
9Aug 29, 2026 10:584,95149,624,30840,059,0001,037,0002,117,632stderr