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 4, 2026 23:02Aleksei ShahoikaAleksei ShahoikaScore: 15,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:0215,337146,253,458105,568,00021,734,0002,404,352
2May 4, 2026 23:0215,350143,726,739105,668,00021,737,0002,408,448
3May 4, 2026 23:0215,372147,920,540105,715,00021,875,0002,404,352
4May 4, 2026 23:0215,377145,968,830105,706,00021,930,0002,408,448
5May 4, 2026 23:0215,504147,632,298106,741,00021,949,0002,412,544
6May 4, 2026 23:0215,533145,509,695106,814,00022,113,0002,408,448
7May 4, 2026 23:0215,585146,571,236106,766,00022,594,0002,412,544
8May 4, 2026 23:0215,654146,074,523106,911,00023,023,0002,408,448
9May 4, 2026 23:0215,675150,480,209106,998,00023,108,0002,408,448