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 listAug 31, 2026 04:32Josu San MartinJosu San MartinScore: 4,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 04:324,35344,568,23735,101,0001,035,0002,113,536
2Aug 31, 2026 04:324,35644,614,06335,114,0001,047,0002,113,536
3Aug 31, 2026 04:324,35944,560,05235,155,0001,029,0002,113,536
4Aug 31, 2026 04:324,36345,883,67335,104,0001,115,0002,113,536
5Aug 31, 2026 04:324,36444,689,57835,130,0001,093,0002,113,536
6Aug 31, 2026 04:324,36544,650,90735,191,0001,042,0002,113,536
7Aug 31, 2026 04:324,36544,654,12235,205,0001,032,0002,113,536
8Aug 31, 2026 04:324,37544,704,19535,196,0001,124,0002,113,536
9Aug 31, 2026 04:324,39044,930,96835,413,0001,028,0002,113,536