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 listFeb 22, 2026 22:57wnwnScore: 4,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 22:574,43463,688,80234,815,0001,989,0002,277,376
2Feb 22, 2026 22:574,43662,969,03334,826,0001,990,0002,535,424
3Feb 22, 2026 22:574,44766,025,92734,914,0001,995,0002,498,560