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 listMar 24, 2026 04:43servant714servant714Score: 99,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 04:4398,467842,987,985635,438,000181,839,0002,281,472
2Mar 24, 2026 04:4398,510842,741,521642,710,000174,921,0002,404,352
3Mar 24, 2026 04:4398,532839,231,428622,861,000194,956,0002,281,472
4Mar 24, 2026 04:4398,878845,565,329642,754,000177,932,0002,281,472
5Mar 24, 2026 04:4399,074847,023,126630,474,000191,840,0002,281,472
6Mar 24, 2026 04:4399,152849,796,540648,968,000173,991,0002,408,448
7Mar 24, 2026 04:4399,222848,513,297625,655,000197,890,0002,281,472
8Mar 24, 2026 04:4399,790853,046,118632,432,000195,824,0002,281,472
9Mar 24, 2026 04:43100,038860,190,861632,481,000197,837,0002,273,280