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:50Josu San MartinJosu San MartinScore: 6,802Success
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:506,42476,031,59550,304,0003,018,0002,424,832
2Jan 1, 2026 20:506,48676,946,90951,843,0001,993,0002,387,968
3Jan 1, 2026 20:506,48878,211,44750,862,0002,991,0002,437,120
4Jan 1, 2026 20:506,80288,172,81455,448,0001,008,0002,523,136
5Jan 1, 2026 20:506,83985,139,15852,781,0003,983,0002,326,528
6Jan 1, 2026 20:506,84285,628,17253,801,0002,988,0002,420,736