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 20, 2026 11:11timothygktimothygkScore: 48,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 11:1147,733407,863,527387,709,0008,480,0002,121,728stderr
2Oct 20, 2026 11:1147,971409,076,109385,628,00012,534,0002,121,728stderr
3Oct 20, 2026 11:1147,978409,944,274389,832,0008,391,0002,121,728stderr
4Oct 20, 2026 11:1147,999409,410,585385,749,00012,650,00028,672stderr
5Oct 20, 2026 11:1148,110410,433,418386,185,00013,136,0002,121,728stderr
6Oct 20, 2026 11:1148,115410,769,902387,779,00011,579,0002,121,728stderr
7Oct 20, 2026 11:1148,150410,590,430385,085,00014,561,00028,672stderr
8Oct 20, 2026 11:1148,732416,667,979389,678,00014,799,0002,117,632stderr
9Oct 20, 2026 11:1149,156419,477,987394,257,00013,740,0002,121,728stderr