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 listJan 2, 2026 16:49Josu San MartinJosu San MartinScore: 7,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 16:496,42876,355,44349,323,0004,026,0002,281,472
2Jan 2, 2026 16:496,78878,705,08154,332,0002,012,0002,306,048
3Jan 2, 2026 16:497,32388,675,59557,793,0002,989,0002,428,928
4Jan 2, 2026 16:497,47285,713,29659,016,0003,000,0002,445,312
5Jan 2, 2026 16:497,49381,203,33059,185,0003,009,0002,502,656
6Jan 2, 2026 16:497,58184,469,43758,931,0003,995,0002,514,944