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 21, 2026 18:49Daniel MastalerzDaniel MastalerzScore: 5,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:495,64271,589,91242,840,0003,985,0002,326,528
2Feb 21, 2026 18:495,64676,189,74644,823,0002,037,0002,285,568
3Feb 21, 2026 18:495,64770,975,66243,877,0002,991,0002,523,136
4Feb 21, 2026 18:495,72371,074,93144,470,0003,032,0002,306,048
5Feb 21, 2026 18:495,74081,330,74845,615,0002,027,0002,310,144
6Feb 21, 2026 18:496,05571,483,23446,237,0004,020,0002,318,336