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 listMar 24, 2026 08:00servant714servant714Score: 88,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:5488,389758,730,321682,658,00050,974,0002,273,280
2Mar 24, 2026 07:5488,488761,843,813669,499,00064,951,0002,428,928
3Mar 24, 2026 08:0088,493755,639,652676,531,00057,959,0002,269,184
4Mar 24, 2026 08:0088,517755,408,842676,713,00057,975,0002,437,120
5Mar 24, 2026 07:5488,547759,182,738675,946,00058,995,0002,273,280
6Mar 24, 2026 08:0088,554758,356,486680,002,00055,000,0002,273,280