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 23, 2026 14:55Charles CabergsCharles CabergsScore: 20,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 14:5519,708179,815,067160,589,0002,992,0002,519,040
2Apr 23, 2026 14:5519,716183,248,881161,638,0002,007,0002,338,816
3Apr 23, 2026 14:5520,444185,242,321166,695,0002,994,0002,514,944
4Apr 23, 2026 14:5520,445187,259,681166,703,0002,994,0002,338,816
5Apr 23, 2026 14:5520,450189,040,439166,745,0002,995,0002,519,040
6Apr 23, 2026 14:5520,451188,684,362166,755,0002,995,0002,514,944
7Apr 23, 2026 14:5520,465185,963,860166,865,0002,997,0002,519,040
8Apr 23, 2026 14:5520,468184,922,752167,894,0001,998,0002,351,104
9Apr 23, 2026 14:5520,471189,970,797166,915,0002,998,0002,502,656