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 listMay 20, 2026 19:42Victor MerckléVictor MerckléScore: 5,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:425,91958,704,92148,050,0001,078,0002,117,632stderr
2May 20, 2026 19:425,94558,690,57348,320,0001,028,0002,117,632stderr
3May 20, 2026 19:425,95058,060,71248,353,0001,037,0002,117,632stderr
4May 20, 2026 19:425,96057,489,55348,448,0001,028,0002,117,632stderr
5May 20, 2026 19:425,97259,489,22448,540,0001,031,0002,117,632stderr
6May 20, 2026 19:425,97258,942,91648,520,0001,055,0002,117,632stderr
7May 20, 2026 19:425,97959,372,29348,564,0001,067,0002,117,632stderr
8May 20, 2026 19:425,98958,373,23648,708,0001,003,0002,117,632stderr
9May 20, 2026 19:426,02760,683,09649,017,0001,009,0002,117,632stderr