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 listOct 15, 2026 13:19timothygktimothygkScore: 65,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 13:1965,433553,747,740318,791,000224,307,0002,117,632stderr
2Oct 15, 2026 13:1965,854557,287,412321,553,000225,037,0002,117,632stderr
3Oct 15, 2026 13:1965,862557,375,221316,261,000230,400,0002,117,632stderr
4Oct 15, 2026 13:1965,872557,421,793315,782,000230,962,0002,117,632stderr
5Oct 15, 2026 13:1965,916557,738,918316,857,000230,254,0002,117,632stderr
6Oct 15, 2026 13:1965,985558,926,088318,086,000229,592,0002,117,632stderr
7Oct 15, 2026 13:1966,257561,953,923319,825,000230,115,0002,117,632stderr
8Oct 15, 2026 13:1966,464562,319,060321,727,000229,928,0002,117,632stderr
9Oct 15, 2026 13:1966,733564,530,281321,415,000232,475,0002,117,632stderr