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 22, 2026 16:01timothygktimothygkScore: 19,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 16:0218,650165,712,404106,151,00048,649,0002,117,632stderr
2Oct 22, 2026 16:0218,676165,952,818106,583,00048,435,0002,121,728stderr
3Oct 22, 2026 16:0218,683167,420,725106,266,00048,809,0002,117,632stderr
4Oct 22, 2026 16:0218,994169,148,828106,397,00051,258,0002,117,632stderr
5Oct 22, 2026 16:0219,012169,317,582106,656,00051,144,0002,117,632stderr
6Oct 22, 2026 16:0219,022168,939,376106,488,00051,397,0002,117,632stderr
7Oct 22, 2026 16:0219,065169,207,839106,872,00051,374,0002,117,632stderr
8Oct 22, 2026 16:0219,118170,114,392106,569,00052,115,0002,117,632stderr
9Oct 22, 2026 16:0219,132170,252,852106,963,00051,833,0002,117,632stderr