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 listJun 27, 2026 10:49Daniel MastalerzDaniel MastalerzScore: 7,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 10:507,43373,928,58460,553,0001,149,0002,113,536
2Jun 27, 2026 10:507,45871,379,05960,742,0001,165,0002,113,536
3Jun 27, 2026 10:507,47971,504,95360,919,0001,163,0002,113,536
4Jun 27, 2026 10:507,48371,574,41360,974,0001,142,0002,113,536
5Jun 27, 2026 10:507,49271,627,42261,037,0001,152,0002,113,536
6Jun 27, 2026 10:507,50871,734,05461,145,0001,175,0002,113,536
7Jun 27, 2026 10:507,58381,646,03361,929,0001,011,0002,113,536
8Jun 27, 2026 10:507,63173,132,63762,151,0001,192,0002,113,536
9Jun 27, 2026 10:507,70882,922,83262,961,0001,018,0002,113,536