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 22:08Mikołaj UzarskiMikołaj UzarskiScore: 5,882Success
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 22:095,77072,230,18442,899,0004,988,0002,371,584
2Feb 19, 2026 22:105,80470,603,18643,158,0005,018,0002,428,928
3Feb 19, 2026 22:105,81276,393,93141,203,0007,034,0002,502,656
4Feb 19, 2026 22:095,88276,593,09642,842,0005,978,0002,293,760
5Feb 19, 2026 22:095,90069,734,41444,974,0003,997,0002,445,312
6Feb 19, 2026 22:106,60085,193,85650,725,0004,058,0002,469,888