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 listAug 2, 2026 18:28TonyTonyScore: 12,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 18:2812,023109,655,62976,716,00023,076,0002,113,536
2Aug 2, 2026 18:2812,044109,819,57377,070,00022,896,0002,113,536
3Aug 2, 2026 18:2812,050109,906,90877,068,00022,954,0002,113,536
4Aug 2, 2026 18:2812,087110,376,69677,477,00022,848,0002,113,536
5Aug 2, 2026 18:2812,105110,346,62377,447,00023,032,0002,113,536
6Aug 2, 2026 18:2812,106110,326,20477,330,00023,156,0002,113,536
7Aug 2, 2026 18:2812,117110,452,18777,442,00023,137,0002,113,536
8Aug 2, 2026 18:2812,129110,536,84077,623,00023,051,0002,113,536
9Aug 2, 2026 18:2812,149110,638,83577,912,00022,929,0002,113,536