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 listSep 1, 2026 01:42C#_userC#_userScore: 64,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 01:4664,703546,785,874482,685,00054,352,0002,142,208
2Sep 1, 2026 01:4664,714546,837,018482,643,00054,484,0002,142,208
3Sep 1, 2026 01:4664,743548,023,657482,032,00055,338,0002,142,208
4Sep 1, 2026 01:4664,756547,033,687482,114,00055,363,0002,138,112
5Sep 1, 2026 01:4664,775547,397,903482,248,00055,390,0002,142,208
6Sep 1, 2026 01:4664,778547,806,560482,083,00055,575,0002,142,208
7Sep 1, 2026 01:4664,789547,488,474482,289,00055,467,0002,142,208
8Sep 1, 2026 01:4664,807547,738,808482,483,00055,417,0002,142,208
9Sep 1, 2026 01:4664,848548,061,500482,852,00055,387,0002,142,208