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 23, 2026 03:58timothygktimothygkScore: 12,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2026 03:5912,375113,881,00181,314,00021,403,0002,117,632stderr
2Oct 23, 2026 03:5912,381115,016,50381,530,00021,238,0002,117,632stderr
3Oct 23, 2026 03:5912,407113,900,05881,512,00021,474,0002,117,632stderr
4Oct 23, 2026 03:5912,411113,942,20982,334,00020,678,0002,117,632stderr
5Oct 23, 2026 03:5912,483114,522,68882,302,00021,313,0002,117,632stderr
6Oct 23, 2026 03:5912,499114,685,18182,786,00020,960,0002,117,632stderr
7Oct 23, 2026 03:5912,515114,835,21082,078,00021,800,0002,117,632stderr
8Oct 23, 2026 03:5912,536115,217,14582,245,00021,809,0002,117,632stderr
9Oct 23, 2026 03:5912,603116,072,57482,682,00021,925,0002,117,632stderr