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 15, 2026 00:19Josu San MartinJosu San MartinScore: 10,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 00:197,37981,050,85259,237,0002,008,0002,449,408
2Jan 15, 2026 00:198,84793,618,82272,423,0001,005,0002,441,216
3Jan 15, 2026 00:1910,212114,315,27682,769,0001,994,0002,441,216
4Jan 15, 2026 00:1910,284109,301,25584,355,0001,004,0002,527,232
5Jan 15, 2026 00:1910,761114,214,08588,314,0001,003,0002,273,280
6Jan 15, 2026 00:1910,845116,655,12088,016,0002,000,0002,510,848