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 listMay 14, 2026 02:39Victor MerckléVictor MerckléScore: 7,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 02:397,23370,089,84060,038,00002,113,536
2May 14, 2026 02:397,23368,543,10859,033,0001,007,0002,113,536
3May 14, 2026 02:397,23569,132,85260,056,00002,113,536
4May 14, 2026 02:397,23570,139,37560,054,00002,113,536
5May 14, 2026 02:397,24369,165,12060,117,00002,113,536
6May 14, 2026 02:397,24367,924,64760,118,00002,113,536
7May 14, 2026 02:397,24469,798,85459,085,0001,044,0002,113,536
8May 14, 2026 02:397,25169,499,28759,145,0001,045,0002,113,536
9May 14, 2026 02:397,29067,813,72960,512,00002,113,536