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 29, 2026 23:34olliecrowolliecrowScore: 7,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 23:357,04678,800,21156,471,0002,016,0002,310,144
2Apr 29, 2026 23:357,08576,949,52755,816,0002,990,0002,408,448
3Apr 29, 2026 23:357,09173,870,16454,871,0003,990,0002,437,120
4Apr 29, 2026 23:357,16276,687,30655,421,0004,030,0002,498,560
5Apr 29, 2026 23:357,20875,342,39755,840,0003,988,0002,494,464
6Apr 29, 2026 23:357,21081,624,47757,852,0001,994,0002,490,368
7Apr 29, 2026 23:357,21382,531,65755,881,0003,991,0002,527,232
8Apr 29, 2026 23:357,25180,009,68656,174,0004,012,0002,473,984
9Apr 29, 2026 23:357,25679,365,71458,223,0002,007,0002,396,160