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 12, 2026 19:33Josu San MartinJosu San MartinScore: 5,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 19:335,24667,801,90541,519,0002,025,0002,510,848
2Apr 12, 2026 19:335,37469,433,60943,592,0001,013,0002,281,472
3Apr 12, 2026 19:335,42263,580,93943,003,0002,000,0002,281,472