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 listJul 11, 2026 20:02ggggScore: 91,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2026 20:0291,265767,162,975698,820,00058,686,0002,113,536
2Jul 11, 2026 20:0291,564769,598,905701,831,00058,156,0002,113,536
3Jul 11, 2026 20:0291,566771,567,419701,394,00058,607,0002,113,536
4Jul 11, 2026 20:0291,630770,063,786701,798,00058,734,0002,113,536
5Jul 11, 2026 20:0291,648770,862,971701,493,00059,186,0002,113,536
6Jul 11, 2026 20:0291,653770,276,086701,532,00059,191,0002,113,536
7Jul 11, 2026 20:0291,653770,270,461701,346,00059,380,0002,113,536
8Jul 11, 2026 20:0291,670770,672,880701,466,00059,396,0002,113,536
9Jul 11, 2026 20:0291,746771,635,357701,903,00059,590,0002,113,536