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 listApr 26, 2026 08:50Charles CabergsCharles CabergsScore: 17,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 08:5117,258158,399,992142,241,0001,001,0002,371,584
2Apr 26, 2026 08:5117,277160,659,087142,405,0001,002,0002,375,680
3Apr 26, 2026 08:5117,292165,552,443142,527,0001,003,0002,363,392
4Apr 26, 2026 08:5117,320161,356,105142,759,000998,0002,306,048
5Apr 26, 2026 08:5117,347160,275,303141,989,0001,999,0002,306,048
6Apr 26, 2026 08:5117,359162,434,325142,079,0002,001,0002,367,488
7Apr 26, 2026 08:5117,906170,417,567146,627,0001,994,0002,375,680
8Apr 26, 2026 08:5118,002165,150,344148,421,0001,002,0002,351,104
9Apr 26, 2026 08:5118,012164,676,870148,497,0001,003,0002,314,240