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 14, 2026 00:34drewbumpasdrewbumpasScore: 52,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:3451,524437,934,833426,572,0001,082,0002,113,536
2Sep 14, 2026 00:3451,597438,427,272427,174,0001,087,0002,113,536
3Sep 14, 2026 00:3451,975441,631,782430,247,0001,146,0002,113,536
4Sep 14, 2026 00:3452,473445,787,411434,436,0001,092,0002,113,536
5Sep 14, 2026 00:3452,521446,073,337434,795,0001,130,0002,113,536
6Sep 14, 2026 00:3452,549446,434,052435,068,0001,093,0002,113,536
7Sep 14, 2026 00:3452,581446,699,429435,171,0001,254,0002,113,536
8Sep 14, 2026 00:3452,582446,735,263435,275,0001,162,0002,113,536
9Sep 14, 2026 00:3452,632447,101,071435,655,0001,195,0002,113,536