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 listSep 29, 2026 10:38wnwnScore: 3,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:383,28135,982,19927,233,000020,480
2Sep 29, 2026 10:383,28436,088,85027,265,000020,480
3Sep 29, 2026 10:383,29036,108,37927,307,000020,480
4Sep 29, 2026 10:383,43037,933,09528,476,000020,480
5Sep 29, 2026 10:383,43237,244,33828,486,000020,480
6Sep 29, 2026 10:383,44438,781,25028,590,000020,480
7Sep 29, 2026 10:383,45538,146,92628,683,000020,480
8Sep 29, 2026 10:383,47838,273,23328,872,000020,480
9Sep 29, 2026 10:383,49038,156,66728,971,000020,480