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 listApr 27, 2026 05:33wnwnScore: 3,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:333,40040,534,09528,222,00002,482,176
2Apr 27, 2026 05:333,44544,349,48927,578,0001,021,0002,330,624
3Apr 27, 2026 05:333,46344,369,68927,719,0001,026,0002,473,984
4Apr 27, 2026 05:333,52749,295,16028,273,0001,009,0002,330,624
5Apr 27, 2026 05:333,56049,095,75528,534,0001,019,0002,486,272
6Apr 27, 2026 05:333,60250,639,22327,910,0001,993,0002,486,272
7Apr 27, 2026 05:333,60545,510,03727,928,0001,994,0002,490,368
8Apr 27, 2026 05:333,61446,028,43028,000,0002,000,0002,486,272
9Apr 27, 2026 05:333,63548,271,21229,171,0001,005,0002,478,080