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:23Victor MerckléVictor MerckléScore: 3,775Success
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:243,75039,529,98530,050,0001,083,0002,117,632stderr
2Aug 12, 2026 23:243,75139,269,54330,018,0001,116,0002,117,632stderr
3Aug 12, 2026 23:243,75839,662,55530,116,0001,081,0002,117,632stderr
4Aug 12, 2026 23:243,76539,684,11930,105,0001,147,0002,117,632stderr
5Aug 12, 2026 23:243,77539,773,11030,213,0001,120,0002,117,632stderr
6Aug 12, 2026 23:243,78339,852,64930,281,0001,126,0002,117,632stderr
7Aug 12, 2026 23:243,79639,951,46530,384,0001,130,0002,117,632stderr
8Aug 12, 2026 23:243,80840,020,30230,506,0001,103,0002,117,632stderr
9Aug 12, 2026 23:243,92841,056,77531,531,0001,075,0002,117,632stderr