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 listMay 10, 2026 18:17Josu San MartinJosu San MartinScore: 4,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:174,10643,319,36233,022,0001,063,0002,113,536
2May 10, 2026 18:174,10842,737,18133,037,0001,067,0002,113,536
3May 10, 2026 18:174,12242,369,97533,166,0001,050,0002,113,536
4May 10, 2026 18:174,12741,806,20733,190,0001,068,0002,113,536
5May 10, 2026 18:174,17445,274,51533,611,0001,040,0002,113,536
6May 10, 2026 18:174,19044,209,44033,724,0001,061,0002,113,536
7May 10, 2026 18:174,19242,474,77833,726,0001,075,0002,113,536
8May 10, 2026 18:174,21942,141,63133,968,0001,051,0002,113,536
9May 10, 2026 18:174,27545,150,44634,417,0001,069,0002,113,536