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 11, 2026 01:19richu shaji abrahamrichu shaji abrahamScore: 45,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 01:1945,846404,323,127377,529,0002,996,0002,363,392
2Apr 11, 2026 01:1945,855404,338,574376,601,0003,995,0002,363,392
3Apr 11, 2026 01:1945,858409,000,937379,623,000999,0002,363,392
4Apr 11, 2026 01:1945,861406,517,502379,651,000999,0002,359,296
5Apr 11, 2026 01:1945,863408,776,591377,662,0002,997,0002,359,296
6Apr 11, 2026 01:1945,863412,435,848377,670,0002,997,0002,363,392
7Apr 11, 2026 01:1945,864408,289,393376,678,0003,996,0002,363,392
8Apr 11, 2026 01:1945,867409,828,793378,696,0001,998,0002,363,392
9Apr 11, 2026 01:1945,867416,112,236377,696,0002,997,0002,375,680