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 21:47Mikołaj UzarskiMikołaj UzarskiScore: 5,911Success
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 21:475,80075,489,26043,128,0005,014,0002,408,448
2Feb 19, 2026 21:475,85076,739,59743,501,0005,058,0002,334,720
3Feb 19, 2026 21:485,86873,068,94141,750,0006,958,0002,383,872
4Feb 19, 2026 21:485,91176,538,64342,053,0007,008,0002,453,504
5Feb 19, 2026 21:475,93673,783,19343,236,0006,032,0002,387,968
6Feb 19, 2026 21:486,01583,922,94541,934,0007,987,0002,433,024