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 listJan 1, 2026 20:16Josu San MartinJosu San MartinScore: 6,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:166,34379,692,96649,611,0003,037,0002,420,736
2Jan 1, 2026 20:166,37673,004,94549,928,0002,995,0002,441,216
3Jan 1, 2026 20:166,38378,315,36249,983,0002,999,0002,408,448
4Jan 1, 2026 20:166,66475,946,41652,294,0003,016,0002,359,296
5Jan 1, 2026 20:166,66980,402,72753,338,0002,012,0002,519,040
6Jan 1, 2026 20:166,70082,226,49454,600,0001,011,0002,494,464