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 1, 2026 21:50Josu San MartinJosu San MartinScore: 8,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:507,77894,908,49161,535,0003,026,0002,502,656
2Jan 1, 2026 21:507,92991,763,51263,818,0001,994,0002,461,696
3Jan 1, 2026 21:508,02593,991,40464,592,0002,018,0002,445,312
4Jan 1, 2026 21:508,11389,564,91364,323,0003,015,0002,433,024
5Jan 1, 2026 21:508,13292,239,15464,472,0003,022,0002,306,048
6Jan 1, 2026 21:508,19194,524,13364,986,0002,999,0002,461,696