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 30, 2026 03:29Josu San MartinJosu San MartinScore: 6,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 03:295,97979,664,22248,615,0001,012,0002,445,312
2Jan 30, 2026 03:296,19871,355,85250,439,0001,008,0002,273,280
3Jan 30, 2026 03:296,28577,245,46250,161,0002,006,0002,441,216
4Jan 30, 2026 03:296,28575,544,54850,163,0002,006,0002,285,568
5Jan 30, 2026 03:296,43774,305,46152,421,0001,008,0002,273,280
6Jan 30, 2026 03:296,44278,044,55952,463,0001,008,0002,453,504