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 listSep 5, 2026 12:59wnwnScore: 3,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:003,27435,664,93526,172,0001,005,0002,113,536
2Sep 5, 2026 13:003,28135,738,23026,225,0001,009,0002,113,536
3Sep 5, 2026 13:003,29535,877,34126,320,0001,036,0002,113,536
4Sep 5, 2026 13:003,30137,633,33526,394,0001,005,0002,113,536
5Sep 5, 2026 13:003,30235,860,00626,376,0001,035,0002,113,536
6Sep 5, 2026 13:003,30436,072,66626,385,0001,045,0002,113,536
7Sep 5, 2026 13:003,30435,918,11126,424,0001,006,0002,113,536
8Sep 5, 2026 13:003,31036,028,42626,429,0001,048,0002,113,536
9Sep 5, 2026 13:003,43837,064,32427,533,0001,005,0002,113,536