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 listMay 10, 2026 14:14Josu San MartinJosu San MartinScore: 4,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:144,20843,931,16933,886,0001,043,0002,113,536
2May 10, 2026 14:144,21342,760,46533,925,0001,050,0002,113,536
3May 10, 2026 14:144,21344,123,08233,925,0001,051,0002,113,536
4May 10, 2026 14:144,21545,465,16633,933,0001,055,0002,113,536
5May 10, 2026 14:144,21843,057,75033,932,0001,085,0002,113,536
6May 10, 2026 14:144,22844,449,48534,032,0001,064,0002,113,536
7May 10, 2026 14:144,24743,341,54934,207,0001,047,0002,113,536
8May 10, 2026 14:144,25345,232,25034,255,0001,047,0002,113,536
9May 10, 2026 14:144,25744,324,03534,289,0001,047,0002,113,536