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 listApr 6, 2026 15:21Danylo MocherniukDanylo MocherniukScore: 6,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 15:216,66974,051,04054,343,0001,006,0002,297,856
2Apr 6, 2026 15:216,67181,906,17454,367,0001,006,0002,297,856
3Apr 6, 2026 15:216,68180,248,56854,447,0001,008,0002,297,856
4Apr 6, 2026 15:216,68578,421,61054,476,0001,008,0002,437,120
5Apr 6, 2026 15:216,68879,567,19753,494,0002,018,0002,437,120
6Apr 6, 2026 15:216,69284,825,30254,535,0001,009,0002,297,856
7Apr 6, 2026 15:216,69781,639,16754,571,0001,010,0002,297,856
8Apr 6, 2026 15:216,70086,556,93654,603,0001,011,0002,297,856
9Apr 6, 2026 15:216,72480,820,05554,799,0001,014,0002,437,120
10Apr 6, 2026 15:216,73381,852,35553,891,0001,995,0002,424,832
11Apr 6, 2026 15:216,74178,534,54353,954,0001,998,0002,416,640
12Apr 6, 2026 15:216,74282,097,28152,963,0002,997,0002,297,856