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 13, 2026 23:31Mikołaj UzarskiMikołaj UzarskiScore: 7,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 23:337,73394,352,81658,171,0006,017,0002,449,408
2Feb 13, 2026 23:337,79194,564,35360,627,0004,041,0002,408,448
3Feb 13, 2026 23:337,82491,351,76757,944,0006,993,0002,404,352