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 12, 2026 10:49Min LiMin LiScore: 2,067,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 10:492,064,47417,167,008,72517,048,171,00086,960,0002,281,472
2Jan 12, 2026 10:492,064,87117,170,817,53817,069,464,00068,969,0002,523,136
3Jan 12, 2026 10:492,066,03917,179,459,96217,084,155,00063,970,0002,281,472
4Jan 12, 2026 10:492,067,50617,194,899,11417,084,332,00075,970,0002,293,760
5Jan 12, 2026 10:492,067,65417,194,713,14817,095,549,00065,978,0002,281,472
6Jan 12, 2026 10:492,068,62417,200,270,93917,110,602,00058,974,0002,281,472
7Jan 12, 2026 10:492,069,23517,208,535,56017,113,683,00060,970,0002,293,760
8Jan 12, 2026 10:492,072,99517,243,734,10917,126,899,00078,962,0002,281,472
9Jan 12, 2026 10:492,156,94217,934,286,89217,847,642,00054,974,0002,281,472