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 23, 2026 08:13ArkadyRudenkoArkadyRudenkoScore: 1,482,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 08:171,479,24822,298,251,8509,381,329,0002,896,432,0002,494,464
2Apr 23, 2026 08:171,479,45822,468,465,0229,510,437,0002,769,068,0002,494,464
3Apr 23, 2026 08:171,481,51022,383,648,6069,437,226,0002,859,308,0002,502,656
4Apr 23, 2026 08:171,481,64922,417,317,6029,436,276,0002,861,414,0002,691,072
5Apr 23, 2026 08:171,482,53622,353,932,9379,496,130,0002,808,927,0002,531,328
6Apr 23, 2026 08:171,482,59122,388,221,6239,439,184,0002,866,323,0002,527,232
7Apr 23, 2026 08:171,483,38022,307,521,5069,505,841,0002,806,219,0002,494,464
8Apr 23, 2026 08:171,484,36022,383,013,6129,422,038,0002,898,156,0002,531,328
9Apr 23, 2026 08:171,506,95222,521,930,2619,702,249,0002,805,457,0002,498,560