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 listJul 6, 2026 21:59boop34boop34Score: 89,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:5988,921748,064,878680,120,00057,931,0002,113,536
2Jul 6, 2026 21:5988,973747,939,855680,108,00058,375,0002,113,536
3Jul 6, 2026 21:5988,985748,664,040680,159,00058,417,0002,113,536
4Jul 6, 2026 21:5989,001748,739,261679,320,00059,390,0002,113,536
5Jul 6, 2026 21:5989,009748,760,364680,039,00058,741,0002,113,536
6Jul 6, 2026 21:5989,036748,944,402680,017,00058,985,0002,113,536
7Jul 6, 2026 21:5989,038748,461,793680,373,00058,644,0002,113,536
8Jul 6, 2026 21:5989,060749,270,652680,185,00059,020,0002,113,536
9Jul 6, 2026 21:5989,076749,063,476679,357,00059,977,0002,113,536