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 28, 2026 06:41C#_userC#_userScore: 62,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 06:4462,365527,459,470463,283,00054,353,0002,142,208
2Aug 28, 2026 06:4462,377527,453,401463,327,00054,406,0002,142,208
3Aug 28, 2026 06:4462,385527,526,023463,376,00054,425,0002,142,208
4Aug 28, 2026 06:4462,410527,648,863462,461,00055,549,0002,203,648
5Aug 28, 2026 06:4462,410527,802,214463,620,00054,384,0002,142,208
6Aug 28, 2026 06:4462,413527,748,857461,906,00056,125,0002,203,648
7Aug 28, 2026 06:4462,413527,725,651462,719,00055,314,0002,203,648
8Aug 28, 2026 06:4462,424527,813,365462,856,00055,271,0002,142,208
9Aug 28, 2026 06:4462,534531,698,669463,538,00055,500,0002,142,208