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 listFeb 19, 2026 19:11wnwnScore: 5,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 19:115,14172,551,08041,656,0001,016,0002,437,120
2Feb 19, 2026 19:115,15765,246,20240,816,0001,991,0002,277,376
3Feb 19, 2026 19:115,16069,157,27642,828,00002,449,408
4Feb 19, 2026 19:115,16064,838,18939,843,0002,988,0002,535,424
5Feb 19, 2026 19:115,17765,786,68140,975,0001,998,0002,277,376
6Feb 19, 2026 19:115,18066,569,05340,992,0001,999,0002,441,216
7Feb 19, 2026 19:115,18464,953,85741,028,0002,001,0002,433,024
8Feb 19, 2026 19:115,22970,750,52443,399,00002,277,376
9Feb 19, 2026 19:115,23271,226,44842,419,0001,009,0002,441,216