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 13, 2026 05:14e1011e1011Score: 66,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 05:1466,479562,399,230494,244,00057,536,0002,113,536
2Oct 13, 2026 05:1466,505563,367,015493,453,00058,543,0002,113,536
3Oct 13, 2026 05:1466,512562,567,208494,179,00057,877,0002,113,536
4Oct 13, 2026 05:1466,521562,742,947494,295,00057,837,0002,113,536
5Oct 13, 2026 05:1466,523563,478,641494,430,00057,716,0002,113,536
6Oct 13, 2026 05:1466,533564,976,431493,841,00058,386,0002,113,536
7Oct 13, 2026 05:1466,535563,370,632493,764,00058,478,0002,113,536
8Oct 13, 2026 05:1466,581563,302,853494,338,00058,289,0002,113,536
9Oct 13, 2026 05:1466,597563,970,994493,955,00058,802,0002,113,536