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 listJan 9, 2026 18:17plklaplklaScore: 71,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 18:1771,257620,186,374531,393,00060,044,0002,322,432
2Jan 9, 2026 18:1771,271622,989,763533,595,00057,956,0002,277,376
3Jan 9, 2026 18:1771,279612,731,718542,649,00048,968,0002,318,336
4Jan 9, 2026 18:1771,347619,085,817534,160,00058,017,0002,277,376
5Jan 9, 2026 18:1771,348620,876,151536,168,00056,017,0002,277,376
6Jan 9, 2026 18:1771,389618,314,804537,571,00054,956,0002,277,376
7Jan 9, 2026 18:1771,393624,742,077541,596,00050,962,0002,314,240
8Jan 9, 2026 18:1771,442620,912,664532,970,00059,996,0002,322,432
9Jan 9, 2026 18:1771,601614,811,198534,259,00060,029,0002,318,336