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 10, 2026 21:43Daniel MastalerzDaniel MastalerzScore: 5,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:435,37069,023,43443,556,0001,012,0002,428,928
2Mar 10, 2026 21:435,37376,435,55942,567,0002,027,0002,420,736
3Mar 10, 2026 21:435,37675,128,02442,592,0002,028,0002,285,568
4Mar 10, 2026 21:435,44373,006,16543,168,0002,007,0002,285,568
5Mar 10, 2026 21:435,44669,767,77243,190,0002,008,0002,285,568
6Mar 10, 2026 21:435,46570,193,86942,338,0003,024,0002,420,736
7Mar 10, 2026 21:435,48075,099,14342,455,0003,032,0002,416,640
8Mar 10, 2026 21:435,48076,097,83643,467,0002,021,0002,277,376
9Mar 10, 2026 21:435,49266,911,29944,570,0001,012,0002,285,568
10Mar 10, 2026 21:435,52066,575,69744,802,0001,018,0002,408,448
11Mar 10, 2026 21:435,55269,216,81843,075,0003,005,0002,519,040
12Mar 10, 2026 21:435,56073,178,66445,149,0001,003,0002,428,928