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 17, 2026 22:34Daniel MastalerzDaniel MastalerzScore: 6,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 22:346,51477,062,52852,064,0002,002,0002,265,088
2Feb 17, 2026 22:346,52177,096,28253,126,0001,002,0002,301,952
3Feb 17, 2026 22:346,52479,910,69852,144,0002,005,0002,265,088
4Feb 17, 2026 22:346,82182,653,82953,634,0002,979,0002,285,568
5Feb 17, 2026 22:346,84588,424,60154,820,0001,993,0002,265,088
6Feb 17, 2026 22:346,84881,092,36753,847,0002,991,0002,265,088