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 15, 2026 12:46Tomislav TunkovicTomislav TunkovicScore: 4,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:504,62647,505,80438,396,000020,480
2Aug 15, 2026 12:504,62846,895,35038,414,000020,480
3Aug 15, 2026 12:504,63047,490,87138,432,000020,480
4Aug 15, 2026 12:504,63446,915,31338,469,000020,480
5Aug 15, 2026 12:504,63546,894,93238,474,000020,480
6Aug 15, 2026 12:504,63647,555,93738,482,000020,480
7Aug 15, 2026 12:504,64047,575,76138,517,000020,480
8Aug 15, 2026 12:504,64147,661,32438,527,000020,480
9Aug 15, 2026 12:504,64247,709,76938,536,000020,480